An Analysis on R%26D Staff of Enterprises High%2Dtech Salary Incentives.

Practical travel time prediction algorithms based on neural network and data fusion for urban expressway.

Multi%2Dlabel learning by exploiting label dependency.
In multi-label learning, each training example is associated with a set of labels and the task is to predict the proper label set for the unseen example. Due to the tremendous (exponential) number of possible label sets, the task of learning from multi-label examples is rather challenging. Therefore, the key to successful multi-label learning is how to effectively exploit correlations between different labels to facilitate the learning process. In this paper, we propose to use a Bayesian network structure to efficiently encode the conditional dependencies of the labels as well as the feature set, with the feature set as the common parent of all labels. To make it practical, we give an approximate yet efficient procedure to find such a network structure. With the help of this network, multi-label learning is decomposed into a series of single-label classification problems, where a classifier is constructed for each label by incorporating its parental labels as additional features. Label sets of unseen examples are predicted recursively according to the label ordering given by the network. Extensive experiments on a broad range of data sets validate the effectiveness of our approach against other well-established methods. Categories and Subject Descriptors I.2.6 [Computing Methodologies]: Learning—concept learning,
Generalized and Heuristic%2DFree Feature Construction for Improved Accuracy.

A parallel logic simulation framework study%2C implementation%2C and performance.

A New Data Integrity Verification Mechanism for SaaS.

svdPPCS an effective singular value decomposition%2Dbased method for conserved and divergent co%2Dexpression gene module identification.

A spatial approach to select pilot counties for programs to correct the biased sex ratio at birth in Shandong province

Convolutive blind source separation by efficient blind deconvolution and minimal filter distortion.
Abstract — onvolutive blind source separation (BSS) usually encounters two difficulties – the filter indeterminacy in the recovered sources and the relatively high computational load. In this paper we propose an efficient method to convolutive BSS, by dealing with these two issues. It consists of two stages, namely, multichannel blind deconvolution (MBD) and learning the postfilters with the minimum filter distortion (MFD) principle. We present a computationally efficient approach to MBD in the first stage: a vector autoregression (VAR) model is first fitted to the data, admitting a closed-form solution and giving temporally independent errors; traditional independent component analysis (ICA) is then applied to these errors to produce the MBD results. In the second stage, the least linear reconstruction error (LLRE) constraint of the separation system, which was previously used to regularize the solutions to nonlinear ICA, enforces a MFD
Researching on Communication Efficiency for the Mobile Physiological Information Monitor System Based on Zigbee.

Causality Discovery with Additive Disturbances An Information%2DTheoretical Perspective.

ICA with Sparse Connections Revisited.

Improve Communication Efficiency for the Physiological Information Monitor System Based on Zigbee.

Cross domain distribution adaptation via kernel mapping.
When labeled examples are limited and difficult to obtain, transfer learning employs knowledge from a source domain to improve learning accuracy in the target domain. However, the assumption made by existing approaches, that the marginal and conditional probabilities are directly related between source and target domains, has limited applicability in either the original space or its linear transformations. To solve this problem, we propose an adaptive kernel approach that maps the marginal distribution of targetdomain and source-domain data into a common kernel space, and utilize a sample selection strategy to draw conditional probabilities between the two domains closer. We formally show that under the kernel-mapping space, the difference in distributions between the two domains is bounded; and the prediction error of the proposed approach can also be bounded. Experimental results demonstrate that the proposed method outperforms both traditional inductive classifiers and the state-of-the-art boosting-based transfer algorithms on most domains, including text categorization and web page ratings. In particular, it can achieve around 10 % higher accuracy than other approaches for the text categorization problem. The source code and datasets are available from the authors.
Bagging.
Bagging predictors is a method for generating multiple versions of a predictor and using these to get an aggregated predictor. The aggregation averages over the versions when predicting a numerical outcome and does a plurality vote when predicting a class. The multiple versions are formed by making bootstrap replicates of the learning set and using these as new learning sets. Tests on real and simulated data sets using classification and regression trees and subset selection in linear regression show that bagging can give substantial gains in accuracy. The vital element is the instability of the prediction method. If perturbing the learning set can cause significant changes in the predictor constructed, then bagging can improve accuracy. 1. Introduction A learning set of L consists of data f(y n ; x n ), n = 1; : : : ; Ng where the y&#039;s are either class labels or a numerical response. We have a procedure for using this learning set to form a predictor &#039;(x; L) --- if the input is x we ...
Breaking the computational barrier a divide%2Dconquer and aggregate based approach for Alu insertion site characterisation.

ArchSim A System%2DLevel Parallel Simulation Platform for the Architecture Design of High Performance Computer.

Application of Improved FCM on Classification of Multi%2Dtarget Guided by AWACS.

Graph%2DBased Iterative Hybrid Feature Selection.

Direct mining of discriminative and essential frequent patterns via model%2Dbased search tree.

Cultural representations of gender among u. s. computer science undergraduates statistical and data mining results.

Forecasting skewed biased stochastic ozone days analyses%2C solutions and beyond.

An Improvement of Matrix%2Dbased Clustering Method for Grouping Learners in E%2DLearning.

Accelerate Data Sharing in a Wide%2DArea Networked File Storage System.

Kernel%2DBased Nonlinear Independent Component Analysis.
Abstract. We propose the kernel-based nonlinear independent component analysis (ICA) method, which consists of two separate steps. First, we map the data to a high-dimensional feature space and perform dimension reduction to extract the effective subspace, which was achieved by kernel principal component analysis (PCA) and can be considered as a pre-processing step. Second, we need to adjust a linear transformation in this subspace to make the outputs as statistically independent as possible. In this way, nonlinear ICA, a complex nonlinear problem, is decomposed into two relatively standard procedures. Moreover, to overcome the ill-posedness in nonlinear ICA solutions, we utilize the minimal nonlinear distortion (MND) principle for regularization, in addition to the smoothness regularizer. The MND principle states that we would prefer the nonlinear ICA solution with the mixing system of minimal nonlinear distortion, since in practice the nonlinearity in the data generation procedure is usually not very strong. 1
Nonlinear independent component analysis with minimal nonlinear distortion.
Nonlinear ICA may not result in nonlinear blind source separation, since solutions to nonlinear ICA are highly non-unique. In practice, the nonlinearity in the data generation procedure is usually not strong. Thus it is reasonable to select the solution with the mixing procedure close to linear. In this paper we propose to solve nonlinear ICA with the “minimal nonlinear distortion ” principle. This is achieved by incorporating a regularization term to minimize the mean square error between the mixing mapping and the best-fitting linear one. As an application, the proposed method helps to identify linear, non-Gaussian, and acyclic causal models when mild nonlinearity exists in the data generation procedure. Using this method to separate daily returns of a set of stocks, we successfully identify their linear causal relations. The resulting causal relations give some interesting insights into the stock market. 1.
Achieving Reliability through Replication in a Wide%2DArea Network DHT Storage System.


Independent Factor Reinforcement Learning for Portfolio Management.


Model Management in Virtual Reality Research.

Agent interface enhancement making multiagent graphical models accessible.

ICA by PCA Approach Relating Higher%2DOrder Statistics to Second%2DOrder Moments.

Enhancement of Source Independence for Blind Source Separation.

Discovering Unrevealed Properties of Probability Estimation Trees On Algorithm Selection and Performance Explanation.

Forecasting Skewed Biased Stochastic Ozone Days Analyses and Solutions.

Extensions of ICA for Causality Discovery in the Hong Kong Stock Market.

ICA with Sparse Connections.
Abstract. When applying independent component analysis (ICA), sometimes we expect that the connections between the observed mixtures and the recovered independent components (or the original sources) to be sparse, to make the interpretation easier or to reduce the model complexity. In this paper we propose natural gradient algorithms for ICA with a sparse separation matrix, as well as ICA with a sparse mixing matrix. The sparsity of the matrix is achieved by applying certain penalty functions to its entries. The properties of the penalty functions are investigated. Experimental results on both artificial data and causality discovery in financial stocks show the usefulness of the proposed methods. 1
Minimizing downtime in seamless migrations of mobile applications.

Memory Protection through Dynamic Access Control.

Symbol Recognition with Kernel Density Matching.

An Adaptive Method for Subband Decomposition ICA.

An Adaptive Method for Subband Decomposition ICA.

An Efficient Algorithm Based on Simulated Annealing for Multicast Routing with Delay and Delay Variation Constraints.

To apply score function difference based ICA algorithms to high%2Ddimensional data.

An Efficient Distributed Dynamic Multicast Routing with Delay and Delay Variation Constraints.

Learning through Changes An Empirical Study of Dynamic Behaviors of Probability Estimation Trees.

Boosting in classifier fusion vs. fusing boosted classifiers.

Efficient application migration under compiler guidance.
Mobile computing based upon wireless technology as the interconnect and PDAs, Web-enabled cell phones etc. as the end devices provide a rich infrastructure for anywhere, anytime information access. Wireless connectivity also poses tough problems [11, 12]. Network nodes may be mobile and the connectivity could be sporadic. In many cases, application mobility involving migration from one network node to another could provide interesting possibilities. However, the migration process is expensive in terms of both time and power overheads. To minimize the migration cost, an efficient strategy must decide which parts of the program should migrate to continue execution and at which program point the migration should take place. In this work we develop a compiler framework to achieve the above two goals. First, the potential migration points are decided by analyzing the call chains in the code. Then the compiler determines what parts of the program are dead at these points. At run time, using the current context of the call chain, a decision on whether to migrate now or later is taken. Such a decision depends mainly upon the cost of migration involved at the current program point vs. at a later potential migration point. Our experiments with multimedia applications show that both the migration state and the latency are significantly reduced by our techniques over the base case of migration with full state in the absence of any compiler guidance. Thus, the key contribution of the paper is to provide an efficient migration methodology removing barriers to application mobility.
Extended Gaussianization Method for Blind Separation of Post%2DNonlinear Mixtures.

Binary translation to improve energy efficiency through post%2Dpass register re%2Dallocation.
Energy efficiency is rapidly becoming a first class optimization parameter for modern systems. Caches are critical to the overall performance and thus, modern processors (both high and low-end) tend to deploy a cache with large size and high degree of associativity. Due a large size cache power takes up a significant percentage of total system power. One important way to reduce cache power consumption is to reduce the dynamic activities in the cache by reducing the dynamic load-store counts. In this work, we focus on programs that are only available as binaries which need to be improved for energy efficiency. For adapting these programs for energy-constrained devices, we propose a feed-back directed post-pass solution that tries to do register re-allocation to reduce dynamic load/store counts and to improve energyefficiency. Our approach is based on zero knowledge of original code generator or compiler and performs a post-pass register allocation to get a more power-efficient binary. We attempt to find out the dead as well as unused registers in the binary and then reallocate them on hot paths to reduce dynamic load/store counts. It is shown that the static code size increase due to our framework is very minimal. Our experiments on SPEC2000 and MediaBench show that our technique is effective. We have seen dynamic spill loads/stores reduction in the data-cache ranging from 0 % to 26.4%. Overall, our approach improves the energy-delay product of the program.
Dimension Reduction Based on Orthogonality %2D A Decorrelation Method in ICA.

HaploBlockFinder Haplotype Block Analyses.

